Termination w.r.t. Q proof of TRS/higher-order/BirdHamming.trs

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(app(if, true), xs), ys) → xs
app(app(app(if, false), xs), ys) → ys
app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(merge, xs), nil) → xs
app(app(merge, nil), ys) → ys
app(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → app(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(mult, 0), x) → 0
app(app(mult, app(s, x)), y) → app(app(plus, y), app(app(mult, x), y))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
list1 → app(app(map, app(mult, app(s, app(s, 0)))), hamming)
list2 → app(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
list3 → app(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
hamming → app(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))

Q is empty.

↳ QTRS

  ↳ Overlay + Local Confluence

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(app(if, true), xs), ys) → xs
app(app(app(if, false), xs), ys) → ys
app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(merge, xs), nil) → xs
app(app(merge, nil), ys) → ys
app(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → app(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(mult, 0), x) → 0
app(app(mult, app(s, x)), y) → app(app(plus, y), app(app(mult, x), y))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
list1 → app(app(map, app(mult, app(s, app(s, 0)))), hamming)
list2 → app(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
list3 → app(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
hamming → app(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))

Q is empty.

The TRS is overlay and locally confluent. By [15] we can switch to innermost.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(app(if, true), xs), ys) → xs
app(app(app(if, false), xs), ys) → ys
app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(merge, xs), nil) → xs
app(app(merge, nil), ys) → ys
app(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → app(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(mult, 0), x) → 0
app(app(mult, app(s, x)), y) → app(app(plus, y), app(app(mult, x), y))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
list1 → app(app(map, app(mult, app(s, app(s, 0)))), hamming)
list2 → app(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
list3 → app(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
hamming → app(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))

The set Q consists of the following terms:

app(app(app(if, true), x0), x1)
app(app(app(if, false), x0), x1)
app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(merge, x0), nil)
app(app(merge, nil), x0)
app(app(merge, app(app(cons, x0), x1)), app(app(cons, x2), x3))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
list1
list2
list3
hamming

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(merge, xs), app(app(cons, y), ys))
LIST2 → APP(s, 0)
APP(app(plus, app(s, x)), y) → APP(s, app(app(plus, x), y))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys))))
LIST3 → HAMMING
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(lt, x)
HAMMING → APP(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))
HAMMING → LIST3
LIST3 → APP(s, 0)
LIST1 → HAMMING
APP(app(mult, app(s, x)), y) → APP(app(plus, y), app(app(mult, x), y))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys)))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(eq, x)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))
LIST1 → APP(map, app(mult, app(s, app(s, 0))))
APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)
APP(app(mult, app(s, x)), y) → APP(plus, y)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(lt, x), y)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(merge, app(app(cons, x), xs)), ys)
HAMMING → APP(merge, list2)
APP(app(mult, app(s, x)), y) → APP(mult, x)
LIST3 → APP(s, app(s, app(s, app(s, app(s, 0)))))
APP(app(map, f), app(app(cons, x), xs)) → APP(cons, app(f, x))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(merge, xs)
LIST2 → APP(s, app(s, app(s, 0)))
HAMMING → APP(s, 0)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(eq, x), y)
LIST2 → APP(s, app(s, 0))
LIST1 → APP(mult, app(s, app(s, 0)))
LIST2 → APP(mult, app(s, app(s, app(s, 0))))
HAMMING → APP(app(merge, list1), app(app(merge, list2), list3))
HAMMING → LIST2
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys)))
LIST1 → APP(app(map, app(mult, app(s, app(s, 0)))), hamming)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(merge, xs), ys)
APP(app(lt, app(s, x)), app(s, y)) → APP(lt, x)
HAMMING → APP(cons, app(s, 0))
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(mult, app(s, x)), y) → APP(app(mult, x), y)
LIST2 → HAMMING
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(if, app(app(eq, x), y))
APP(app(plus, app(s, x)), y) → APP(plus, x)
LIST3 → APP(s, app(s, 0))
APP(app(lt, app(s, x)), app(s, y)) → APP(app(lt, x), y)
LIST1 → APP(s, app(s, 0))
LIST3 → APP(s, app(s, app(s, app(s, 0))))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(if, app(app(lt, x), y))
HAMMING → APP(app(merge, list2), list3)
HAMMING → LIST1
LIST2 → APP(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
LIST3 → APP(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0)))))))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
LIST3 → APP(mult, app(s, app(s, app(s, app(s, app(s, 0))))))
HAMMING → APP(merge, list1)
LIST3 → APP(s, app(s, app(s, 0)))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
LIST3 → APP(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
LIST2 → APP(map, app(mult, app(s, app(s, app(s, 0)))))
LIST1 → APP(s, 0)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(cons, x), app(app(merge, xs), ys))

The TRS R consists of the following rules:

app(app(app(if, true), xs), ys) → xs
app(app(app(if, false), xs), ys) → ys
app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(merge, xs), nil) → xs
app(app(merge, nil), ys) → ys
app(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → app(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(mult, 0), x) → 0
app(app(mult, app(s, x)), y) → app(app(plus, y), app(app(mult, x), y))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
list1 → app(app(map, app(mult, app(s, app(s, 0)))), hamming)
list2 → app(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
list3 → app(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
hamming → app(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))

The set Q consists of the following terms:

app(app(app(if, true), x0), x1)
app(app(app(if, false), x0), x1)
app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(merge, x0), nil)
app(app(merge, nil), x0)
app(app(merge, app(app(cons, x0), x1)), app(app(cons, x2), x3))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
list1
list2
list3
hamming

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(merge, xs), app(app(cons, y), ys))
LIST2 → APP(s, 0)
APP(app(plus, app(s, x)), y) → APP(s, app(app(plus, x), y))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys))))
LIST3 → HAMMING
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(lt, x)
HAMMING → APP(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))
HAMMING → LIST3
LIST3 → APP(s, 0)
LIST1 → HAMMING
APP(app(mult, app(s, x)), y) → APP(app(plus, y), app(app(mult, x), y))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys)))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(eq, x)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))
LIST1 → APP(map, app(mult, app(s, app(s, 0))))
APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)
APP(app(mult, app(s, x)), y) → APP(plus, y)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(lt, x), y)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(merge, app(app(cons, x), xs)), ys)
HAMMING → APP(merge, list2)
APP(app(mult, app(s, x)), y) → APP(mult, x)
LIST3 → APP(s, app(s, app(s, app(s, app(s, 0)))))
APP(app(map, f), app(app(cons, x), xs)) → APP(cons, app(f, x))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(merge, xs)
LIST2 → APP(s, app(s, app(s, 0)))
HAMMING → APP(s, 0)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(eq, x), y)
LIST2 → APP(s, app(s, 0))
LIST1 → APP(mult, app(s, app(s, 0)))
LIST2 → APP(mult, app(s, app(s, app(s, 0))))
HAMMING → APP(app(merge, list1), app(app(merge, list2), list3))
HAMMING → LIST2
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys)))
LIST1 → APP(app(map, app(mult, app(s, app(s, 0)))), hamming)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(merge, xs), ys)
APP(app(lt, app(s, x)), app(s, y)) → APP(lt, x)
HAMMING → APP(cons, app(s, 0))
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(mult, app(s, x)), y) → APP(app(mult, x), y)
LIST2 → HAMMING
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(if, app(app(eq, x), y))
APP(app(plus, app(s, x)), y) → APP(plus, x)
LIST3 → APP(s, app(s, 0))
APP(app(lt, app(s, x)), app(s, y)) → APP(app(lt, x), y)
LIST1 → APP(s, app(s, 0))
LIST3 → APP(s, app(s, app(s, app(s, 0))))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(if, app(app(lt, x), y))
HAMMING → APP(app(merge, list2), list3)
HAMMING → LIST1
LIST2 → APP(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
LIST3 → APP(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0)))))))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
LIST3 → APP(mult, app(s, app(s, app(s, app(s, app(s, 0))))))
HAMMING → APP(merge, list1)
LIST3 → APP(s, app(s, app(s, 0)))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
LIST3 → APP(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
LIST2 → APP(map, app(mult, app(s, app(s, app(s, 0)))))
LIST1 → APP(s, 0)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(cons, x), app(app(merge, xs), ys))

The TRS R consists of the following rules:

app(app(app(if, true), xs), ys) → xs
app(app(app(if, false), xs), ys) → ys
app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(merge, xs), nil) → xs
app(app(merge, nil), ys) → ys
app(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → app(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(mult, 0), x) → 0
app(app(mult, app(s, x)), y) → app(app(plus, y), app(app(mult, x), y))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
list1 → app(app(map, app(mult, app(s, app(s, 0)))), hamming)
list2 → app(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
list3 → app(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
hamming → app(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))

The set Q consists of the following terms:

app(app(app(if, true), x0), x1)
app(app(app(if, false), x0), x1)
app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(merge, x0), nil)
app(app(merge, nil), x0)
app(app(merge, app(app(cons, x0), x1)), app(app(cons, x2), x3))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
list1
list2
list3
hamming

We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

LIST2 → APP(s, 0)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(merge, xs), app(app(cons, y), ys))
APP(app(plus, app(s, x)), y) → APP(s, app(app(plus, x), y))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys))))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(cons, app(f, x)), app(app(map, f), xs))
LIST3 → HAMMING
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(lt, x)
HAMMING → APP(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))
HAMMING → LIST3
LIST3 → APP(s, 0)
LIST1 → HAMMING
APP(app(mult, app(s, x)), y) → APP(app(plus, y), app(app(mult, x), y))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys)))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(eq, x)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))
LIST1 → APP(map, app(mult, app(s, app(s, 0))))
APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)
APP(app(mult, app(s, x)), y) → APP(plus, y)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(lt, x), y)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(merge, app(app(cons, x), xs)), ys)
HAMMING → APP(merge, list2)
LIST3 → APP(s, app(s, app(s, app(s, app(s, 0)))))
APP(app(mult, app(s, x)), y) → APP(mult, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(cons, app(f, x))
LIST2 → APP(s, app(s, app(s, 0)))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(merge, xs)
HAMMING → APP(s, 0)
LIST2 → APP(s, app(s, 0))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(eq, x), y)
LIST2 → APP(mult, app(s, app(s, app(s, 0))))
LIST1 → APP(mult, app(s, app(s, 0)))
HAMMING → APP(app(merge, list1), app(app(merge, list2), list3))
HAMMING → LIST2
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys)))
LIST1 → APP(app(map, app(mult, app(s, app(s, 0)))), hamming)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(merge, xs), ys)
APP(app(lt, app(s, x)), app(s, y)) → APP(lt, x)
HAMMING → APP(cons, app(s, 0))
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
LIST2 → HAMMING
APP(app(mult, app(s, x)), y) → APP(app(mult, x), y)
APP(app(plus, app(s, x)), y) → APP(plus, x)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(if, app(app(eq, x), y))
APP(app(lt, app(s, x)), app(s, y)) → APP(app(lt, x), y)
LIST3 → APP(s, app(s, 0))
LIST1 → APP(s, app(s, 0))
LIST3 → APP(s, app(s, app(s, app(s, 0))))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(if, app(app(lt, x), y))
HAMMING → LIST1
HAMMING → APP(app(merge, list2), list3)
LIST3 → APP(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0)))))))
LIST2 → APP(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
LIST3 → APP(mult, app(s, app(s, app(s, app(s, app(s, 0))))))
HAMMING → APP(merge, list1)
LIST3 → APP(s, app(s, app(s, 0)))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
LIST3 → APP(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
LIST2 → APP(map, app(mult, app(s, app(s, app(s, 0)))))
LIST1 → APP(s, 0)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(cons, x), app(app(merge, xs), ys))

The TRS R consists of the following rules:

app(app(app(if, true), xs), ys) → xs
app(app(app(if, false), xs), ys) → ys
app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(merge, xs), nil) → xs
app(app(merge, nil), ys) → ys
app(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → app(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(mult, 0), x) → 0
app(app(mult, app(s, x)), y) → app(app(plus, y), app(app(mult, x), y))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
list1 → app(app(map, app(mult, app(s, app(s, 0)))), hamming)
list2 → app(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
list3 → app(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
hamming → app(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))

The set Q consists of the following terms:

app(app(app(if, true), x0), x1)
app(app(app(if, false), x0), x1)
app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(merge, x0), nil)
app(app(merge, nil), x0)
app(app(merge, app(app(cons, x0), x1)), app(app(cons, x2), x3))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
list1
list2
list3
hamming

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 6 SCCs with 48 less nodes.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                    ↳ QDPOrderProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)

The TRS R consists of the following rules:

app(app(app(if, true), xs), ys) → xs
app(app(app(if, false), xs), ys) → ys
app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(merge, xs), nil) → xs
app(app(merge, nil), ys) → ys
app(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → app(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(mult, 0), x) → 0
app(app(mult, app(s, x)), y) → app(app(plus, y), app(app(mult, x), y))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
list1 → app(app(map, app(mult, app(s, app(s, 0)))), hamming)
list2 → app(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
list3 → app(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
hamming → app(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))

The set Q consists of the following terms:

app(app(app(if, true), x0), x1)
app(app(app(if, false), x0), x1)
app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(merge, x0), nil)
app(app(merge, nil), x0)
app(app(merge, app(app(cons, x0), x1)), app(app(cons, x2), x3))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
list1
list2
list3
hamming

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13]. Here, we combined the reduction pair processor with the A-transformation [14] which results in the following intermediate Q-DP Problem.
Q DP problem:
The TRS P consists of the following rules:

PLUS(s(x), y) → PLUS(x, y)

R is empty.
The set Q consists of the following terms:

if(true, x0, x1)
if(false, x0, x1)
lt(s(x0), s(x1))
lt(0, s(x0))
lt(x0, 0)
eq(x0, x0)
eq(s(x0), 0)
eq(0, s(x0))
merge(x0, nil)
merge(nil, x0)
merge(cons(x0, x1), cons(x2, x3))
map(x0, nil)
map(x0, cons(x1, x2))
mult(0, x0)
mult(s(x0), x1)
plus(0, x0)
plus(s(x0), x1)
list1
list2
list3
hamming

We have to consider all minimal (P,Q,R)-chains.

The following pairs can be oriented strictly and are deleted.

APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
PLUS(x1, x2) = x1
s(x1) = s(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(app(if, true), xs), ys) → xs
app(app(app(if, false), xs), ys) → ys
app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(merge, xs), nil) → xs
app(app(merge, nil), ys) → ys
app(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → app(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(mult, 0), x) → 0
app(app(mult, app(s, x)), y) → app(app(plus, y), app(app(mult, x), y))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
list1 → app(app(map, app(mult, app(s, app(s, 0)))), hamming)
list2 → app(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
list3 → app(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
hamming → app(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))

The set Q consists of the following terms:

app(app(app(if, true), x0), x1)
app(app(app(if, false), x0), x1)
app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(merge, x0), nil)
app(app(merge, nil), x0)
app(app(merge, app(app(cons, x0), x1)), app(app(cons, x2), x3))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
list1
list2
list3
hamming

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP(app(mult, app(s, x)), y) → APP(app(mult, x), y)

The TRS R consists of the following rules:

app(app(app(if, true), xs), ys) → xs
app(app(app(if, false), xs), ys) → ys
app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(merge, xs), nil) → xs
app(app(merge, nil), ys) → ys
app(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → app(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(mult, 0), x) → 0
app(app(mult, app(s, x)), y) → app(app(plus, y), app(app(mult, x), y))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
list1 → app(app(map, app(mult, app(s, app(s, 0)))), hamming)
list2 → app(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
list3 → app(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
hamming → app(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))

The set Q consists of the following terms:

app(app(app(if, true), x0), x1)
app(app(app(if, false), x0), x1)
app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(merge, x0), nil)
app(app(merge, nil), x0)
app(app(merge, app(app(cons, x0), x1)), app(app(cons, x2), x3))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
list1
list2
list3
hamming

MULT(s(x), y) → MULT(x, y)

R is empty.
The set Q consists of the following terms:

if(true, x0, x1)
if(false, x0, x1)
lt(s(x0), s(x1))
lt(0, s(x0))
lt(x0, 0)
eq(x0, x0)
eq(s(x0), 0)
eq(0, s(x0))
merge(x0, nil)
merge(nil, x0)
merge(cons(x0, x1), cons(x2, x3))
map(x0, nil)
map(x0, cons(x1, x2))
mult(0, x0)
mult(s(x0), x1)
plus(0, x0)
plus(s(x0), x1)
list1
list2
list3
hamming

We have to consider all minimal (P,Q,R)-chains.

The following pairs can be oriented strictly and are deleted.

APP(app(mult, app(s, x)), y) → APP(app(mult, x), y)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
MULT(x1, x2) = x1
s(x1) = s(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(app(if, true), xs), ys) → xs
app(app(app(if, false), xs), ys) → ys
app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(merge, xs), nil) → xs
app(app(merge, nil), ys) → ys
app(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → app(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(mult, 0), x) → 0
app(app(mult, app(s, x)), y) → app(app(plus, y), app(app(mult, x), y))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
list1 → app(app(map, app(mult, app(s, app(s, 0)))), hamming)
list2 → app(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
list3 → app(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
hamming → app(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))

The set Q consists of the following terms:

app(app(app(if, true), x0), x1)
app(app(app(if, false), x0), x1)
app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(merge, x0), nil)
app(app(merge, nil), x0)
app(app(merge, app(app(cons, x0), x1)), app(app(cons, x2), x3))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
list1
list2
list3
hamming

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP(app(lt, app(s, x)), app(s, y)) → APP(app(lt, x), y)

The TRS R consists of the following rules:

app(app(app(if, true), xs), ys) → xs
app(app(app(if, false), xs), ys) → ys
app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(merge, xs), nil) → xs
app(app(merge, nil), ys) → ys
app(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → app(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(mult, 0), x) → 0
app(app(mult, app(s, x)), y) → app(app(plus, y), app(app(mult, x), y))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
list1 → app(app(map, app(mult, app(s, app(s, 0)))), hamming)
list2 → app(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
list3 → app(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
hamming → app(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))

The set Q consists of the following terms:

app(app(app(if, true), x0), x1)
app(app(app(if, false), x0), x1)
app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(merge, x0), nil)
app(app(merge, nil), x0)
app(app(merge, app(app(cons, x0), x1)), app(app(cons, x2), x3))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
list1
list2
list3
hamming

LT(s(x), s(y)) → LT(x, y)

R is empty.
The set Q consists of the following terms:

if(true, x0, x1)
if(false, x0, x1)
lt(s(x0), s(x1))
lt(0, s(x0))
lt(x0, 0)
eq(x0, x0)
eq(s(x0), 0)
eq(0, s(x0))
merge(x0, nil)
merge(nil, x0)
merge(cons(x0, x1), cons(x2, x3))
map(x0, nil)
map(x0, cons(x1, x2))
mult(0, x0)
mult(s(x0), x1)
plus(0, x0)
plus(s(x0), x1)
list1
list2
list3
hamming

We have to consider all minimal (P,Q,R)-chains.

The following pairs can be oriented strictly and are deleted.

APP(app(lt, app(s, x)), app(s, y)) → APP(app(lt, x), y)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
LT(x1, x2) = x2
s(x1) = s(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(app(if, true), xs), ys) → xs
app(app(app(if, false), xs), ys) → ys
app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(merge, xs), nil) → xs
app(app(merge, nil), ys) → ys
app(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → app(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(mult, 0), x) → 0
app(app(mult, app(s, x)), y) → app(app(plus, y), app(app(mult, x), y))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
list1 → app(app(map, app(mult, app(s, app(s, 0)))), hamming)
list2 → app(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
list3 → app(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
hamming → app(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))

The set Q consists of the following terms:

app(app(app(if, true), x0), x1)
app(app(app(if, false), x0), x1)
app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(merge, x0), nil)
app(app(merge, nil), x0)
app(app(merge, app(app(cons, x0), x1)), app(app(cons, x2), x3))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
list1
list2
list3
hamming

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                  ↳ QDP

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(merge, xs), ys)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(merge, xs), app(app(cons, y), ys))
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(merge, app(app(cons, x), xs)), ys)

The TRS R consists of the following rules:

app(app(app(if, true), xs), ys) → xs
app(app(app(if, false), xs), ys) → ys
app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(merge, xs), nil) → xs
app(app(merge, nil), ys) → ys
app(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → app(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(mult, 0), x) → 0
app(app(mult, app(s, x)), y) → app(app(plus, y), app(app(mult, x), y))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
list1 → app(app(map, app(mult, app(s, app(s, 0)))), hamming)
list2 → app(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
list3 → app(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
hamming → app(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))

The set Q consists of the following terms:

app(app(app(if, true), x0), x1)
app(app(app(if, false), x0), x1)
app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(merge, x0), nil)
app(app(merge, nil), x0)
app(app(merge, app(app(cons, x0), x1)), app(app(cons, x2), x3))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
list1
list2
list3
hamming

MERGE(cons(x, xs), cons(y, ys)) → MERGE(xs, cons(y, ys))
MERGE(cons(x, xs), cons(y, ys)) → MERGE(cons(x, xs), ys)
MERGE(cons(x, xs), cons(y, ys)) → MERGE(xs, ys)

R is empty.
The set Q consists of the following terms:

if(true, x0, x1)
if(false, x0, x1)
lt(s(x0), s(x1))
lt(0, s(x0))
lt(x0, 0)
eq(x0, x0)
eq(s(x0), 0)
eq(0, s(x0))
merge(x0, nil)
merge(nil, x0)
merge(cons(x0, x1), cons(x2, x3))
map(x0, nil)
map(x0, cons(x1, x2))
mult(0, x0)
mult(s(x0), x1)
plus(0, x0)
plus(s(x0), x1)
list1
list2
list3
hamming

We have to consider all minimal (P,Q,R)-chains.

The following pairs can be oriented strictly and are deleted.

APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(merge, xs), ys)
APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(merge, app(app(cons, x), xs)), ys)

The remaining pairs can at least be oriented weakly.

APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(merge, xs), app(app(cons, y), ys))

Used ordering: Combined order from the following AFS and order.
MERGE(x1, x2) = x2
cons(x1, x2) = cons(x2)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                  ↳ QDP

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(merge, xs), app(app(cons, y), ys))

The TRS R consists of the following rules:

app(app(app(if, true), xs), ys) → xs
app(app(app(if, false), xs), ys) → ys
app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(merge, xs), nil) → xs
app(app(merge, nil), ys) → ys
app(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → app(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(mult, 0), x) → 0
app(app(mult, app(s, x)), y) → app(app(plus, y), app(app(mult, x), y))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
list1 → app(app(map, app(mult, app(s, app(s, 0)))), hamming)
list2 → app(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
list3 → app(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
hamming → app(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))

The set Q consists of the following terms:

app(app(app(if, true), x0), x1)
app(app(app(if, false), x0), x1)
app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(merge, x0), nil)
app(app(merge, nil), x0)
app(app(merge, app(app(cons, x0), x1)), app(app(cons, x2), x3))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
list1
list2
list3
hamming

MERGE(cons(x, xs), cons(y, ys)) → MERGE(xs, cons(y, ys))

R is empty.
The set Q consists of the following terms:

if(true, x0, x1)
if(false, x0, x1)
lt(s(x0), s(x1))
lt(0, s(x0))
lt(x0, 0)
eq(x0, x0)
eq(s(x0), 0)
eq(0, s(x0))
merge(x0, nil)
merge(nil, x0)
merge(cons(x0, x1), cons(x2, x3))
map(x0, nil)
map(x0, cons(x1, x2))
mult(0, x0)
mult(s(x0), x1)
plus(0, x0)
plus(s(x0), x1)
list1
list2
list3
hamming

We have to consider all minimal (P,Q,R)-chains.

The following pairs can be oriented strictly and are deleted.

APP(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → APP(app(merge, xs), app(app(cons, y), ys))

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
MERGE(x1, x2) = x1
cons(x1, x2) = cons(x2)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ PisEmptyProof

                  ↳ QDP

                  ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(app(if, true), xs), ys) → xs
app(app(app(if, false), xs), ys) → ys
app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(merge, xs), nil) → xs
app(app(merge, nil), ys) → ys
app(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → app(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(mult, 0), x) → 0
app(app(mult, app(s, x)), y) → app(app(plus, y), app(app(mult, x), y))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
list1 → app(app(map, app(mult, app(s, app(s, 0)))), hamming)
list2 → app(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
list3 → app(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
hamming → app(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))

The set Q consists of the following terms:

app(app(app(if, true), x0), x1)
app(app(app(if, false), x0), x1)
app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(merge, x0), nil)
app(app(merge, nil), x0)
app(app(merge, app(app(cons, x0), x1)), app(app(cons, x2), x3))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
list1
list2
list3
hamming

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)

The TRS R consists of the following rules:

app(app(app(if, true), xs), ys) → xs
app(app(app(if, false), xs), ys) → ys
app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(merge, xs), nil) → xs
app(app(merge, nil), ys) → ys
app(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → app(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(mult, 0), x) → 0
app(app(mult, app(s, x)), y) → app(app(plus, y), app(app(mult, x), y))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
list1 → app(app(map, app(mult, app(s, app(s, 0)))), hamming)
list2 → app(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
list3 → app(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
hamming → app(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))

The set Q consists of the following terms:

app(app(app(if, true), x0), x1)
app(app(app(if, false), x0), x1)
app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(merge, x0), nil)
app(app(merge, nil), x0)
app(app(merge, app(app(cons, x0), x1)), app(app(cons, x2), x3))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
list1
list2
list3
hamming

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
APP(x1, x2) = x2
app(x1, x2) = app(x1, x2)
cons = cons

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

                  ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(app(if, true), xs), ys) → xs
app(app(app(if, false), xs), ys) → ys
app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(merge, xs), nil) → xs
app(app(merge, nil), ys) → ys
app(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → app(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(mult, 0), x) → 0
app(app(mult, app(s, x)), y) → app(app(plus, y), app(app(mult, x), y))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
list1 → app(app(map, app(mult, app(s, app(s, 0)))), hamming)
list2 → app(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
list3 → app(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
hamming → app(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))

The set Q consists of the following terms:

app(app(app(if, true), x0), x1)
app(app(app(if, false), x0), x1)
app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(merge, x0), nil)
app(app(merge, nil), x0)
app(app(merge, app(app(cons, x0), x1)), app(app(cons, x2), x3))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
list1
list2
list3
hamming

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

HAMMING → LIST3
LIST2 → HAMMING
HAMMING → LIST1
HAMMING → LIST2
LIST1 → HAMMING
LIST3 → HAMMING

The TRS R consists of the following rules:

app(app(app(if, true), xs), ys) → xs
app(app(app(if, false), xs), ys) → ys
app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(merge, xs), nil) → xs
app(app(merge, nil), ys) → ys
app(app(merge, app(app(cons, x), xs)), app(app(cons, y), ys)) → app(app(app(if, app(app(lt, x), y)), app(app(cons, x), app(app(merge, xs), app(app(cons, y), ys)))), app(app(app(if, app(app(eq, x), y)), app(app(cons, x), app(app(merge, xs), ys))), app(app(cons, y), app(app(merge, app(app(cons, x), xs)), ys))))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(mult, 0), x) → 0
app(app(mult, app(s, x)), y) → app(app(plus, y), app(app(mult, x), y))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
list1 → app(app(map, app(mult, app(s, app(s, 0)))), hamming)
list2 → app(app(map, app(mult, app(s, app(s, app(s, 0))))), hamming)
list3 → app(app(map, app(mult, app(s, app(s, app(s, app(s, app(s, 0))))))), hamming)
hamming → app(app(cons, app(s, 0)), app(app(merge, list1), app(app(merge, list2), list3)))

The set Q consists of the following terms:

app(app(app(if, true), x0), x1)
app(app(app(if, false), x0), x1)
app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(merge, x0), nil)
app(app(merge, nil), x0)
app(app(merge, app(app(cons, x0), x1)), app(app(cons, x2), x3))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(mult, 0), x0)
app(app(mult, app(s, x0)), x1)
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
list1
list2
list3
hamming

We have to consider all minimal (P,Q,R)-chains.